Connecting up

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reuse Contracts: Connecting Bottom-Up and Top-Down Reuse

Whereas most object-oriented technologies traditionally achieve reuse in a bottom-up fashion, the research areas of architectures and domain analysis advocate a top-down approach to achieve systematic reuse. Practice shows that a combination of both is often desired or needed. The reuse contracts model can provide such a combination and can make the connection between object technology, archite...

متن کامل

2-connecting Outerplanar Graphs without Blowing Up the Pathwidth

Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). This settles an open problem raised by Biedl [1], in the context of computing minimum height planar straight line drawings of outerplanar graphs, with their vertices placed on a two dimensional grid. In conjunction...

متن کامل

CONNECTING T AND LATTICE-VALUED CONVERGENCES

$top$-filters can be used to define $top$-convergence spaces in the lattice-valued context. Connections between $top$-convergence spaces and lattice-valued convergence spaces are given. Regularity of a $top$-convergence space has recently been defined and studied by Fang and Yue. An equivalent characterization is given in the present work in terms of convergence of closures of $top$-filters.  M...

متن کامل

Connecting Yule Process, Bisection and Binary Search Tree via Martingales

We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.

متن کامل

Connecting Sciences

Abstract: Real progress in science is dependent on novel ideas. In Artificial Intelligence, for a long time (1950-1997) a prevailing question was: can a computer chess program defeat the human World Champion? In 1997 this turned out to be the case by using a supercomputer employing the minimax method with many enhancements, such as opponent modeling. The next question was: can we use similar te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1988

ISSN: 0028-0836,1476-4687

DOI: 10.1038/335475b0